Analysis of parametric biological models with non-linear dynamics

In this paper we present recent results on parametric analysis of biological models. The underlying method is based on the algorithms for computing trajectory sets of hybrid systems with polynomial dynamics. The method is then applied to two case studies of biological systems: one is a cardiac cell model for studying the conditions for cardiac abnormalities, and the second is a model of insect nest-site choice.Comment: In Proceedings HSB 2012, arXiv:1208.315

Techniques pour l'analyse formelle de systèmes dynamiques non-linéaires

In this thesis, we presented our contributions to the formal analysis of dynamical systems. We focused on the problem of efficiently computing an accurate approximation of the reachable sets under nonlinear dynamics given by differential equations. Our aim was also to design scalable methods which can handle large systems. The first contribution of this thesis concerns the dynamic hybridization technique for a large class of nonlinear systems. We focused on the hybridization domain construction such that the linear interpolation realized in this domain ensures a desired error between the original system trajectories and those computed with the approximated system. We propose a construction method which tends to maximize the domain volume which reduce the number of creation of new domains during the analysis. The second research direction that we followed concerns a subclass of nonlinear dynamical systems which are the polynomial systems. Our results for the reachability analysis of these systems are based on the Bernstein expansion properties. We approximate an initial reachability computation (which requires solving polynomial optimization problems) with an accurate over-approximation (which requires solving linear optimization problems). The last theoretical contribution concerns the reachability analysis of linear systems with polyhedral input which often result from approximation of nonlinear systems. We proposed a technique to refineCette thèse porte sur les techniques d'analyse formelle de systèmes hybrides à dynamiques continues non linéaire. Ses contributions portent sur les algorithmes d'atteignabilité et sur les problèmatiques liées à la representation des ensembles atteignables. This thesis deals with formal analysis of hybrid system with non linear continous dynamic. It contributes to the fields of reachability analysis algorithm and the set representation

Techniques for the formal analysis of non-linear dynamical systems

Cette thèse porte sur les techniques d'analyse formelle de systèmes hybrides à dynamiques continues non linéaire. Ses contributions portent sur les algorithmes d'atteignabilité et sur les problèmatiques liées à la representation des ensembles atteignables. This thesis deals with formal analysis of hybrid system with non linear continous dynamic. It contributes to the fields of reachability analysis algorithm and the set representation.In this thesis, we presented our contributions to the formal analysis of dynamical systems. We focused on the problem of efficiently computing an accurate approximation of the reachable sets under nonlinear dynamics given by differential equations. Our aim was also to design scalable methods which can handle large systems. The first contribution of this thesis concerns the dynamic hybridization technique for a large class of nonlinear systems. We focused on the hybridization domain construction such that the linear interpolation realized in this domain ensures a desired error between the original system trajectories and those computed with the approximated system. We propose a construction method which tends to maximize the domain volume which reduce the number of creation of new domains during the analysis. The second research direction that we followed concerns a subclass of nonlinear dynamical systems which are the polynomial systems. Our results for the reachability analysis of these systems are based on the Bernstein expansion properties. We approximate an initial reachability computation (which requires solving polynomial optimization problems) with an accurate over-approximation (which requires solving linear optimization problems). The last theoretical contribution concerns the reachability analysis of linear systems with polyhedral input which often result from approximation of nonlinear systems. We proposed a technique to refin

Techniques pour l'analyse formelle de systèmes dynamiques non-linéaires

Cette thèse porte sur les techniques d'analyse formelle de systèmes hybrides à dynamiques continues non linéaire. Ses contributions portent sur les algorithmes d'atteignabilité et sur les problèmatiques liées à la representation des ensembles atteignables. This thesis deals with formal analysis of hybrid system with non linear continous dynamic. It contributes to the fields of reachability analysis algorithm and the set representation.In this thesis, we presented our contributions to the formal analysis of dynamical systems. We focused on the problem of efficiently computing an accurate approximation of the reachable sets under nonlinear dynamics given by differential equations. Our aim was also to design scalable methods which can handle large systems. The first contribution of this thesis concerns the dynamic hybridization technique for a large class of nonlinear systems. We focused on the hybridization domain construction such that the linear interpolation realized in this domain ensures a desired error between the original system trajectories and those computed with the approximated system. We propose a construction method which tends to maximize the domain volume which reduce the number of creation of new domains during the analysis. The second research direction that we followed concerns a subclass of nonlinear dynamical systems which are the polynomial systems. Our results for the reachability analysis of these systems are based on the Bernstein expansion properties. We approximate an initial reachability computation (which requires solving polynomial optimization problems) with an accurate over-approximation (which requires solving linear optimization problems). The last theoretical contribution concerns the reachability analysis of linear systems with polyhedral input which often result from approximation of nonlinear systems. We proposed a technique to refineSAVOIE-SCD - Bib.électronique (730659901) / SudocGRENOBLE1/INP-Bib.électronique (384210012) / SudocGRENOBLE2/3-Bib.électronique (384219901) / SudocSudocFranceF

Reachability analysis of polynomial systems using linear programming relaxations

Abstract. In this paper we propose a new method for reachability analysis of the class of discrete-time polynomial dynamical systems. Our work is based on the approach combining the use of template polyhedra and optimizatio